Optimal Time Broadcasting Schemes in Faulty Star Graphs
نویسندگان
چکیده
We propose two fault-tolerant broadcasting schemes in star graphs. One of the schemes can tolerate up to n − 2 faults of the crash type in the n-star graph. The other scheme can tolerate up to ⌊ n−3d−1 2 ⌋ faults of the Byzantine type in the n-star graph, where d is the smallest positive integer satisfying n ≤ d!. Each of the schemes is designed for the single-port mode, and it completes the broadcasting in O(n log n) time. These schemes are time optimal. For the former scheme we analyze the reliability in the case where faults of the crash type are randomly distributed. It can tolerate (n!)α faults randomly distributed in the n-star graph with a high probability, where α is any constant less than 1. key words: broadcasting, Byzantine faults, crash faults, fault tolerance, star graphs
منابع مشابه
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an n-dimensional star graph, our algorithm takes O( n log, n ) time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting m packets in a pipeline fashion takes O( m log, n + n log, n ) time due to the non...
متن کاملAn Optimal d−1-Fault-Tolerant Broadcasting Scheme for d-Dimensional Hypercubes
Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. We propose a k-fault-tolerant broadcasting scheme for a faulty d-dimensional hypercube where 0≤ k<d. For the whispering model, the new scheme requires 2d time units that are optimal for faulty-hypercubes. Moreover, it onl...
متن کاملA Routing and Broadcasting Scheme on Faulty Star Graphs
In this paper we present a routing algorithm that uses the depth rst search approach combined with a backtracking technique to route messages on the star graph in the presence of faulty links. The algorithm is distributed and requires no global knowledge of faults. The only knowledge required at a node is the state of its incident links. The routed message carries information about the followed...
متن کاملOptimal Time Broadcasting in Faulty Star Networks
This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the sch...
متن کاملOptimal broadcasting on incomplete star graph interconnection networks
Broadcasting is an important collective communication operation in many applications which use parallel computing. In this paper, we focus on designing broadcasting algorithms for general incomplete star graphs. We propose two optimal one-to-all broadcasting algorithms for incomplete star graphs with a single-port communication model. An incomplete star graph with N nodes, where (n 1)! < N < n!...
متن کامل